M_2-edge colorings of cacti and graph joins
نویسندگان
چکیده
منابع مشابه
Interval edge-colorings of graph products
An interval t coloring of a graph is a proper edgecoloring of with colors 1, such that at least one edge of G is colored by and the edges incident to each vertex − G G 2, , t ... , 1, 2, , , i i t = ... ( ) v V G ∈ are colored by consecutive colors, where is the degree of the vertex in . In this paper interval edge-colorings of various graph products are investigated. ( ) G d v ( ) G d v v G
متن کاملEven edge colorings of a graph
It is shown that the minimum number of colors needed to paint the edges of a graph G so that in every cycle of G there is a nonzero even number of edges of at least one color is rlog,X(G)l. For a simple graph G, let E(G) denote the minimum number 1 for which there exists a partition of E(G) into 1 subsets Ej, 1 d id 1, satisfying for any cycle Z of G, 0 < [E(Z) n Eil= 0 (mod 2) for at least one...
متن کاملThe strong edge colorings of a sparse random graph
The strong chromatic index of a graph G is the smallest integer k such that the edge set E( G) can be partitioned into k induced subgraphs of G which form matchings. In this paper we consider the behavior of the strong chromatic index of a sparse random graph K (n, p), where p = p(n) = 0(1).
متن کاملFinding Reconfigurations between List Edge-Colorings of a Graph
Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. Recently, Ito et al. [5] proposed a framework of reconfiguration problems, and gave complexity and approximability results for reconfiguration problems derived from several well-known problems, such as independent set...
متن کاملReconfiguration of List Edge-Colorings in a Graph
We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing only one edge color assignment at a time, while at all times maintaining a list edge-coloring, given a list of allowed colors for each edge. First we show that this problem is PSPACE-complete, even for planar graphs of maximum degree 3 and just six colors. We then consider the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2016
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1842